Genetic algorithm for the continuous location-routing problem

This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots. The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal. The standard location-routing problem considers a finite number of possible locations. The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex. We present a genetic algorithm that tackles both location and routing subproblems simultaneously.Web of Science29318717

USE OF FLOYD ALGORITHM IN NETWORKS

Článek se zabývá využitím Floydova algoritmu pro výpočet vzdáleností na síti, propustností sítě a nejspolehlivější cesty sítě.This article deals with a use of Floyd algorithm for calculation of distances in a network, permeability of a network and the most reliable paths of a network

USING OF GRAPH THEORY FOR SUMMONING FLOOD OF MEMBERS OF THE COMMISSION

Článek se zabývá návrhem tras pro funkci spojky zajišťující obslužnost předsedů a členů povodňových komisí při vydané výstraze od Českého hydrometeorologického ústavu a následně vyhlášení I. stupně povodňové aktivity toku, kdy nelze využít služeb mobilního operátora ať z důvodu lidské chyby nebo výpadku signálu. Je použita úloha obchodního cestujícího, exaktní metodou řešení Littlovým algoritmem a pro srovnání kvality řešení heuristikou heuristickým algoritmem.The article deals with the coupling paths for ensuring accessibility chairmen and members of the commissions on flood alert issued by the Czech Hydrometeorological Institute and the subsequent announcement of the first degree flood flow, which cannot use the services of the mobile operator whether due to human error or loss of signal. It is used in the role of traveling salesman, exact method of solution Little algorithm and for comparing the quality of solutions heuristic by heuristic algorithm

OPTIMIZATION OF DISTRIBUTING SYSTEM OF CAR SPARE PARTS

Článek se zabývá problematikou optimalizace zásobování na trhu náhradních dílů tak, aby cena poskytovaných služeb byla optimální a náklady byly minimální. Přičemž největší pozornost je věnována optimalizaci dopravy, především problému optimalizace rozvozových tras, kde primárním kritériem bude časové hledisko.This article deals with the problems of optimization of car spare parts supply in a market, so that the price of service occupation was optimal and costs were minimal. The best attention paid to optimization of transportation, especially vehicle routing and primary criterion was aspect of time

IMPACTS OF THE FAILURE OF SELECTED TRANSPORT INFRASTRUCTURE ELEMENTS

History provides many cases in which the failure of transport of food and other materials led to great loss of lives and turnovers in wars. Therefore, the transport infrastructure is one of the main infrastructures that create a critical infrastructure in the area. The object of monitoring are thus not only the immediate impacts of selected critical components, but the whole cascade of potential impacts at selected time intervals during the loss of functionality of transport system; the whole supply chain is influenced at failures of critical items. The research objective is to monitor and subsequently evaluate the severity of the consequences of failure of two selected elements of transport infrastructure. These are studied impacts on public assets in two cases of failure: the critical section of the busiest highway; and bus station in the centre of a large city